Skip to content

Implement one arbitrary-input once-rounded selected MOVE as a literal tape graph (no kappa) - #7568

Open
CubeJerry wants to merge 2 commits into
CrocSwap:mainfrom
CubeJerry:research/literal-once-rounded-move-20261113
Open

CubeJerry wants to merge 2 commits into
CrocSwap:mainfrom
CubeJerry:research/literal-once-rounded-move-20261113

Conversation

@CubeJerry

Copy link
Copy Markdown
Contributor

Result

Implement selected MOVE24472 on arbitrary signed inputs using a fixed 54-tape graph, paid widening and one final nearest-UP round. Prove direct time/history bounds and restored owners; reject true final overflow before public writes.

Checks and limits

84,935 locations; all 82,813 embedded core instructions checked; independent full 25,467,658-step packet and exact converter/source checks. Supplied packed entry and cutoff remain premises. The selected exact-layer route requires another caller/error proof before interior substitution. No new kappa; all five global assumptions remain.

Credit

Prepared for @CubeJerry with substantial OpenAI assistance. Credit #7211, #7426, #7428, #7429, #7430, #7468 and the pinned Gaussian/core lineage.

Complete description, exact pins, reproduction and limitations.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant